Optimization of Logistic Processes Using Ant Colonies∗
نویسندگان
چکیده
The scheduling of logistic processes modeled by birth-anddeath processes is a combinatorial problem. We consider here the problem of dynamic assignment of components to orders. In this paper, a distributed algorithm based on ant colonies is proposed to optimize this assignment. The ant-agents jointly test several different combinations and choose the solution that is able to deliver more orders at the correct delivery date, while keeping the delay variance small for the orders that are not delivered at the desired date. A simulation example is presented, comparing this algorithm with three other scheduling methods. Results show the effectiveness of the proposed algorithm.
منابع مشابه
Ant Colonies as Logistic Processes Optimizers
This paper proposes a new framework for the optimization of logistic processes using ant colonies. The application of the method to real data does not allow to test different parameter settings on a trial and error basis. Therefore, a sensitive analysis of the algorithm parameters is done in a simulation environment, in order to provide a correlation between the different coefficients. The prop...
متن کاملA Logistic Process Scheduling Problem: Genetic Algorithms or Ant Colony Optimization?
This paper compares the optimization of a logistic scheduling problem using two different optimization techniques; the genetic algorithms and the ant colony optimization. The comparison is preceded by a literature review that summarizes the available comparison results for different benchmark problems and tries to generalize the differences between the techniques. The simulation results for the...
متن کاملOptimization of Logistic Processes Using Predictive Ants
In previous papers, we have shown that the Ant Colony Optimization (ACO) algorithm could be used as a distributed scheduling strategy for logistic processes. The distributed framework allow us to easily introduce new features that can improve the scheduling methods. An example is a prediction mechanism, introduced in this paper. A statistical model of the system provides a reliable prediction m...
متن کاملParallel Ant Colonies for Combinatorial Optimization Problems
Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is...
متن کاملA Multilevel k–way Partitioning Algorithm for Finite Element Meshes using Competing Ant Colonies
The self–organizing properties of ant colonies are employed to tackle the classical combinatorial optimization problem of graph partitioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for resources. Using Genetic Programming, a Foraging Strategy is evolved which when executed by the ants in each colony leads to a restructuring of...
متن کامل